Universal hashing

Results: 119



#Item
51More Robust Hashing: Cuckoo Hashing with a Stash∗ Adam Kirsch† Michael Mitzenmacher‡  Udi Wieder§

More Robust Hashing: Cuckoo Hashing with a Stash∗ Adam Kirsch† Michael Mitzenmacher‡ Udi Wieder§

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2009-09-30 13:31:47
52Keccak and SHA-3: code and standard updates Guido Bertoni1 Joan Daemen1 Michaël Peeters2 Gilles Van Assche1 Ronny Van Keer1 1 STMicroelectronics 2 NXP

Keccak and SHA-3: code and standard updates Guido Bertoni1 Joan Daemen1 Michaël Peeters2 Gilles Van Assche1 Ronny Van Keer1 1 STMicroelectronics 2 NXP

Add to Reading List

Source URL: fosdem.org

Language: English - Date: 2015-02-18 08:01:24
53Ideal Hash Trees Phil Bagwell Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash tr

Ideal Hash Trees Phil Bagwell Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash tr

Add to Reading List

Source URL: lampwww.epfl.ch

Language: English - Date: 2001-10-05 03:05:47
54§1. Elements of Hashing  Lecture XI Page 1

§1. Elements of Hashing Lecture XI Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2012-11-13 11:24:25
55Page 1  Lecture XI §1. Elements of Hashing

Page 1 Lecture XI §1. Elements of Hashing

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-11-21 18:48:42
56Randomness in Cryptography  January 10, 2013 Lecture 1: One-Time MACs, (XOR)Universal hashing, Weak Keys Lecturer: Yevgeniy Dodis

Randomness in Cryptography January 10, 2013 Lecture 1: One-Time MACs, (XOR)Universal hashing, Weak Keys Lecturer: Yevgeniy Dodis

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2014-03-05 15:25:16
57April 11, 2013  Randomness in Cryptography Lecture 13: Seed-Dependent Key Derivation Lecturer: Yevgeniy Dodis

April 11, 2013 Randomness in Cryptography Lecture 13: Seed-Dependent Key Derivation Lecturer: Yevgeniy Dodis

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-12-19 22:46:30
58Journal of Universal Computer Science, vol. 14, no[removed]), [removed]submitted: 2/6/07, accepted: [removed], appeared: 1/2/08 © J.UCS New Results on NMAC/HMAC when Instantiated with Popular Hash Functions Christian Rechb

Journal of Universal Computer Science, vol. 14, no[removed]), [removed]submitted: 2/6/07, accepted: [removed], appeared: 1/2/08 © J.UCS New Results on NMAC/HMAC when Instantiated with Popular Hash Functions Christian Rechb

Add to Reading List

Source URL: www.jucs.org

Language: English - Date: 2008-09-17 07:43:00
59out/LINPB-rand.lhug-7.Time.sorted.eps

out/LINPB-rand.lhug-7.Time.sorted.eps

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2009-12-20 15:49:04
60Tabulation Based 4-Universal Hashing with Applications to Second Moment Estimation Mikkel Thorup Yin Zhang

Tabulation Based 4-Universal Hashing with Applications to Second Moment Estimation Mikkel Thorup Yin Zhang

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2004-11-12 12:54:20